A Non-deterministic View on Non-classical Negations
نویسنده
چکیده
منابع مشابه
Yager's new class of implications Jf and some classical tautologies
has introduced a new class of fuzzy implications, denoted J f , called the f-generated implications and has discussed some of their desirable properties, such as neutrality, exchange principle, etc. In this work, we discuss the class of J f implications with respect to three classical logic tautologies, viz., distributivity, law of importation and contrapositive symmetry. Necessary and sufficie...
متن کاملAn Almost Classical Logic for Logic Programming and Nonmonotonic Reasoning
The model theory of a first-order logic called N is introduced. N does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N is very close to classical logic: N has two truth values; implications are, in N like in classical logic, material; and negation distributes over compound formulas in N as it does in classical logic. Results suggest that the se...
متن کاملA Proof Procedure for Functional First Order Logic Programs with Non-Deterministic Lazy Functions and Built-in Predicates
We present a proof procedure for functional first-order logic programs. The programs we consider allow first-order goals (including disjunctions, conjunctions, negations, and quantifications on elements of the domain). Atoms are either built-in statements or reduction statements of the form t → s, meaning that t is reducible to s. Call-time choices are used and the functions are non-determinist...
متن کاملLimiting negations in non-deterministic circuits
The minimum number of NOT gates in a Boolean circuit computing a Boolean function f is called the inversion complexity of f . In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that ⌈log 2 (n+ 1)⌉ NOT gates are sufficient to compute any Boolean function on n variables. In this paper, we consider circuits computing non-deterministically and dete...
متن کاملNon-commutative fuzzy structures and pairs of weak negations
Weak pseudo BL-algebras (WPBL-algebras) are non-commutative fuzzy structures which arise from pseudot-norms (i.e. the non-commutative versions of triangular norms). In this paper, we study the pairs of weak negations on WPBL-algebras, extending the case of weak negations on Esteva–Godo MTL-algebras. A geometrical characterization of the pairs of weak negations in bounded chains is provided. Our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 80 شماره
صفحات -
تاریخ انتشار 2005